A multi-depot travelling salesman problem and its iterative and integrated approaches
نویسندگان
چکیده
منابع مشابه
The multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملSelf-Crossover and Its Application to the Travelling Salesman Problem
Crossover is an important genetic operation that helps in random recombination of structured information to locate new points in the search space, in order to achieve a good solution to an optimization problem. The conventional crossover operation when applied on a pair of binary strings will usually not retain the total number of 1’s in the offsprings to be the same as that of their parents. B...
متن کاملApproaches to the Travelling Salesman Problem Using Evolutionary Computing Algorithms
Genetic algorithms (GAs) were developed as problem independent search algorithms (Goldberg, 1989; Holland, 1975; Man et al., 1999), which simulate the biological evolution to search for an optimal solution to a problem. Figure 1(a) shows the main processes of genetic algorithms. When developing a genetic algorithm, we analyze the properties of the problem and determine the “gene encoding” polic...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملA Survey on Travelling Salesman Problem
The Travelling Salesman problem is one of the most popular problems from the NP set, it is also one of the hardest too. The solution to this problem enjoys wide applicability in a variety of practical fields. Thus it highly raises the need for an efficient solution for this NP Hard problem. However even the most common deterministic solutions to the problem are known to possess an exponential t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Operational Research
سال: 2006
ISSN: 1745-7645,1745-7653
DOI: 10.1504/ijor.2006.010211